Scaling Ion Trap Quantum Computation through Fast Quantum Gates
نویسندگان
چکیده
منابع مشابه
Scaling ion trap quantum computation through fast quantum gates.
We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through spin-dependent acceleration of the ions from periodic photon kicks. The gates are shown to be robust to influence all the other ions in the array and insensitive to t...
متن کاملIon-Trap Quantum Computation
Quantum computation requires a very special physical environment. Numerous operations must be performed on the quantum states of the qubits (or quantum bits) before those states decohere, or lose the interlocking phase relationships that give quantum computation its power. Thought to be an unavoidable outcome of the interaction between the quantum state and the environment, decoherence threaten...
متن کاملScaling the ion trap quantum processor.
Trapped atomic ions are standards for quantum information processing, serving as quantum memories, hosts of quantum gates in quantum computers and simulators, and nodes of quantum communication networks. Quantum bits based on trapped ions enjoy a rare combination of attributes: They have exquisite coherence properties, they can be prepared and measured with nearly 100% efficiency, and they are ...
متن کاملIon trap quantum gates with amplitude-modulated laser beams
In ion traps, entangling gate operations can be realized by a bichromatic pair of laser beams that collectively interact with the ions. In this paper, a new method of modelling the laser-ion interaction is introduced that turns out to be superior to standard techniques for the description of gate operations on optical qubits. The treatment allows for a comparison of the performance of gates bas...
متن کاملEfficient quantum computation with probabilistic quantum gates.
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2004
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.93.100502